Proportional cost buyback problem with weight bounds
نویسندگان
چکیده
منابع مشابه
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
In the buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to some constraints on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost that is a fixed fraction of the bid value. Previous to our work, deterministic and randomized algorithms ...
متن کاملRandomized Online Algorithms for the Buyback Problem
In the matroid buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to a matroid constraint on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost which is a fixed fraction of the bid value. We present a new randomized algorithm for this pr...
متن کاملNonlinear Buyback Problem with Discrete Concave Valuation Functions
We discuss an online discrete optimization problem called the buyback problem. In the literature of the buyback problem, the valuation function representing the value of a set of selected elements is given by a linear function. In this paper, we consider a generalization of the buyback problem using a nonlinear valuation function. We propose an online algorithm for the problem with a discrete c...
متن کاملImproved Lower Bounds for the Proportional Lot Sizing and Scheduling Problem
Where standard MIP{solvers fail to compute optimum objective function values for certain MIP{model formulations, lower bounds may be used as a point of reference for evaluating heuristics. In this paper, we compute lower bounds for the multi{level proportional lot sizing and scheduling problem with multiple machines (PLSP{MM). Four approaches are compared: Solving LP{relaxations of two di erent...
متن کاملqfd planning with cost consideration in fuzzy environment
در عصر حاضر که رقابت بین سازمان ها بسیار گسترش یافته است، مطالعه و طرحریزی سیستم های تولیدی و خدماتی به منظور بهینه سازی عملکرد آنها اجتناب ناپذیر می باشد. بخش عمده ای از رقابت پذیری سازمان ها نتیجه رضایتمندی مشتریان آنها است. میزان موفقیت سازمان های امروزی به تلاش آنها در جهت شناسایی خواسته ها و نیازهای مشتریان و ارضای این نیازها بستگی دارد. از طرفی کوتاه کردن زمان ارائه محصول/خدمات به مشتریان...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.06.005